A Timely Distributed Consensus Solution in a Crash/Omission-Fault Environment

نویسندگان

  • George M. A. Lima
  • Alan Burns
چکیده

A timely protocol to solve the distributed consensus problem that tolerates process crashes and message omissions is described. The protocol is optimal in terms of the number of communication steps needed to achieve consensus. The model on which the protocol is based relies on a priority-based communication network, a kind of network commonly used in practice to support real-time systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Failure Detection and Consensus in the General Omission Failure Model to Solve Security Problems

It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensus. The reduction uses the concept of security modules which reduce the type and nature of adversarial behavior to two standard fault-assumptions: message omission and process crash. In this paper, we investigate the f...

متن کامل

Uniform Agreement Despite Process Omission Failures

A process fails by omission if it “forgets” to send or receive messages. Considering omission failures is crucial for distributed systems, as such failures model both crash failures and incorrect behavior of process input/output buffers (such as buffer overflow). So, designing protocols that cope not only with crash failures but also with omission failures is a real challenge as soon as one is ...

متن کامل

Revisiting Failure Detection and Consensus in Omission Failure Environments

It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensus. The reduction uses the concept of security modules which reduce the type and nature of adversarial behavior to two standard faultassumptions: message omission and process crash. In this paper, we investigate the fe...

متن کامل

Synchronous Set Agreement : a Concise Guided Tour ( with Open Problems ) Michel Raynal Corentin Travers

The k-set agreement problem is a paradigm of coordination problems encountered in distributed computing. The parameter k defines the coordination degree we are interested in. The case k corresponds to the well-known uniform consensus problem. More precisely, the k-set agreement problem considers a system made up of n processes where each process proposes a value. It requires that each non-fault...

متن کامل

The perfectly synchronized round-based model of distributed computing

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy. We describe a technique to automatically transform protocols devised in the perfectly-synchronized round-based model into protocols for the crash, send omission, general omission or Byzantine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001